Cubical Homology of Asynchronous Transition Systems

نویسنده

A. A. Khusainov

چکیده

We show that a set with an action of a locally finite-dimensional free partially commutative monoid and the corresponding semicubical set have isomorpic homology groups. We build a complex of finite length for the computing homology groups of any asynchronous transition system with finite maximal number of mutually independent events. We give examples of computing the homology groups. 2000 Mathematics Subject Classification 18G10, 18G35, 55U10, 68Q10, 68Q85

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Cubical Homology Groups of Free Partially Commutative Monoids

We study a Leech homology of a locally bounded free partially commutative monoid M(E, I). Given a contravariant natural system of abelian groups F on M(E, I) we build a precubical set T (E, I) with a homological system of abelian groups F and prove that the Leech homology groups Hn(M(E, I), F ) are isomorphic to the cubical homology groups Hn(T (E, I), F ), n > 0. As a consequence we have confi...

متن کامل

The Cubical Homology of Trace Monoids

Trace monoids have found many applications in computer science [3], [19]. M. Bednarczyk [2] studied and applied the category of asynchronous systems. The author has proved that any asynchronous system can be regarded as a partial trace monoid with action on a set. It allows us to build homology theory for the category of asynchronous systems and Petri nets [9]. It should be noted that the homol...

متن کامل

Cubical Sets are Generalized Transition Systems

We show in this article that \labelled" cubical sets (or Higher-Dimensional Automata) are a natural generalization of transition systems and asynchronous transition systems. This generalizes an older result of 14] which was only holding with precubical sets and subcat-egories of the classical (see 29]) categories of transition systems and asynchronous transition systems. This opens up new promi...

متن کامل

Homology and Bisimulation of Asynchronous Transition Systems and Petri Nets

Homology groups of labelled asynchronous transition systems and Petri nets are introduced. Examples of computing the homology groups are given. It is proved that if labelled asynchronous transition systems are bisimulation equivalent, then they have isomorphic homology groups. A method of constructing a Petri net with given homology groups is found. 2000 Mathematics Subject Classification 18G35...

متن کامل